Edge degree conditions for subpancyclicity in line graphs
نویسندگان
چکیده
منابع مشابه
Degree conditions for forests in graphs
IfH is any forest of order nwithm edges, then any graphG of order nwith d(u)+d(v) 2m−1 for any two non-adjacent vertices u, v contains H.
متن کاملEdge Neighborhoods in Line Graphs
By an edge-neighborhood of an edge f in a graph we mean the subgraph induced by nodes outside f which are adjacent to some node on f. Connected graphs whose line graphs have the same edge-neighborhood of any edge are characterized. There are P 4 , stars, complete graphs and regular triangle-free graphs in which any two nodes with the distance two have the same number of common neighbors. Object...
متن کاملCritical graphs for subpancyclicity of 3-connected claw-free graphs
Let Fk be the family of graphs G such that all sufficiently large k-connected claw-free graphs which contain no induced copies of G are subpancyclic. We show that for every k≥3 the family F1k is infinite and make the first step toward the complete characterization of the family F3. 2009 Wiley Periodicals, Inc. J Graph Theory 62: 263–278, 2009 Contract grant sponsor: KBN (T. L.); Contract grant ...
متن کاملColor degree and color neighborhood union conditions for long heterochromatic paths in edge - colored graphs ∗
Let G be an edge-colored graph. A heterochromatic (rainbow, or multicolored) path of G is such a path in which no two edges have the same color. Let d(v) denote the color degree and CN(v) denote the color neighborhood of a vertex v of G. In a previous paper, we showed that if d(v) ≥ k (color degree condition) for every vertex v of G, then G has a heterochromatic path of length at least ⌈ 2 ⌉, a...
متن کاملColor Degree Sum Conditions for Rainbow Triangles in Edge-Colored Graphs
Let G be an edge-colored graph and v a vertex of G. The color degree of v is the number of colors appearing on the edges incident to v. A rainbow triangle in G is one in which all edges have distinct colors. In this paper, we first prove that an edge-colored graph on n vertices contains a rainbow triangle if the color degree sum of any two adjacent vertices is at least n+ 1. Afterwards, we char...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1998
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(97)00257-4